Global Optimization and Integer Programming Networks
نویسنده
چکیده
In this era of Cloud Computing and Service Architecture, it is expected that web services will proliferate the current market and business will expose their web service’s as B2B, C2B, E2E and C2C service componets, many web services offer the similar services, and the clients application will demand more value added services and informative services rather than those offered by single entity ,or isolated web services. Synthesis of Service Semantics with high quality is prominent and in high demand, Internet based applications share webservices and offer services as data pipelines and social computing. The client applications are experiencing cost and quality intensive competition to select service portfolio and create semantics service composition, among numerous possible plans, that satisfy their quality-of-service (QoS) requirements. Typical QoS attributes associated with a semantic fabric services are the consumption cost and time, availability of services, dynamic runtime service execution rate, service and entity reputation, and web trends of service frequency and performance payload support. This paper describes the service composition architecture and webservice composition algorithm based on combinatorial and Poisson distribution. As mathematical and implementation framework of the service algorithm maintains the high standard of service QoS composition in a business portfolio of service category and assists the business entity and client application to have better service selection and QoS of request and response.
منابع مشابه
Global optimization of mixed-integer polynomial programming problems: A new method based on Grobner Bases theory
Mixed-integer polynomial programming (MIPP) problems are one class of mixed-integer nonlinear programming (MINLP) problems where objective function and constraints are restricted to the polynomial functions. Although the MINLP problem is NP-hard, in special cases such as MIPP problems, an efficient algorithm can be extended to solve it. In this research, we propose an algorit...
متن کاملA generalized implicit enumeration algorithm for a class of integer nonlinear programming problems
Presented here is a generalization of the implicit enumeration algorithm that can be applied when the objec-tive function is being maximized and can be rewritten as the difference of two non-decreasing functions. Also developed is a computational algorithm, named linear speedup, to use whatever explicit linear constraints are present to speedup the search for a solution. The method is easy to u...
متن کاملSufficient global optimality conditions for general mixed integer nonlinear programming problems
In this paper, some KKT type sufficient global optimality conditions for general mixed integer nonlinear programming problems with equality and inequality constraints (MINPP) are established. We achieve this by employing a Lagrange function for MINPP. In addition, verifiable sufficient global optimality conditions for general mixed integer quadratic programming problems are der...
متن کاملA Novel Method for Designing and Optimization of Networks
In this paper, system planning network is formulated with mixed-integer programming. Two meta-heuristic procedures are considered for this problem. The cost function of this problem consists of the capital investment cost in discrete form, the cost of transmission losses and the power generation costs. The DC load flow equations for the network are embedded in the constraints of the mathematica...
متن کاملA robust multi-objective global supplier selection model under currency fluctuation and price discount
Robust supplier selection problem, in a scenario-based approach has been proposed, when the demand and exchange rates are subject to uncertainties. First, a deterministic multi-objective mixed integer linear programming is developed; then, the robust counterpart of the proposed mixed integer linear programming is presented using the recent extension in robust optimization theory. We discuss dec...
متن کاملA Modified Discreet Particle Swarm Optimization for a Multi-level Emergency Supplies Distribution Network
Currently, the research of emergency supplies distribution and decision models mostly focus on deterministic models and exact algorithm. A few of studies have been done on the multi-level distribution network and matheuristic algorithm. In this paper, random processes theory is adopted to establish emergency supplies distribution and decision model for multi-level network. By analyzing the char...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012